package com.kobe.algorithm.leetcode.case200;

/**
 * @author ：caopengfei
 * @date ：2021/2/24
 */
public class SolutionBfs {
    public int numIslands(char[][] grid) {
        int landsNums = 0;
        return landsNums;
    }



    public static void main(String[] args) {
        char [][]  grid = {{'1','1','0','1','0'},
                           {'1','1','0','1','0'},
                           {'1','1','0','0','1'},
                           {'0','0','0','1','0'}};
        SolutionBfs solution = new SolutionBfs();
        System.out.println(solution.numIslands(grid));
    }
}
